Configurable verification of timed automata with discrete variables
نویسندگان
چکیده
منابع مشابه
Verification for Timed Automata Extended with Unbounded Discrete Data Structures
We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper i...
متن کاملAutomatic Verification of Multi-queue Discrete Timed Automata
We propose a new infinite-state model, called the Multi-queue Discrete Timed Automaton MQDTA, which extends Timed Automata with queues, but only has integer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations ( of an MQDTA such that can reach through zero or more transitions) is effectively semilinear. We then prove the deci...
متن کاملGeneralized Discrete Timed Automata: Decidable Approximations for Safety Verification
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the hB; ricrossing-bounded approximation), and derive automata-theoretic characterizations of the binary re...
متن کاملVerification in loosely synchronous queue-connected discrete timed automata
We look at a model of a queue system that consists of the following components: 1. Two discrete timed automata W (the “writer”) and R (“the reader”). 2. One unrestricted queue that can be used to send messages from W to R. There is no bound on the length of the queue. W and R do not share a global clock and operate in a loosely synchronous way. That is, the absolute value of the difference betw...
متن کاملVerification of Web Services with Timed Automata
In this paper we show how we can use formal methods for describing and analyzing the behavior of Web Services, and more specifically those including time restrictions. Then, our starting point are Web Services descriptions written in WSCI WSCDL (XML-based description languages). These descriptions are then translated into timed automata, and then, we use a well known tool that supports this for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2020
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-020-00393-4